State constraints and pathwise decomposition of programs
نویسندگان
چکیده
منابع مشابه
State Constraints and Pathwise Decomposition of Programs
A state constraint is a new programming construct designed to restrict the domain of definition of a program. It can be used to decompose a program pathwise, i.e., to divide the program into subprograms along the control flow, as opposed to divide the program across the control flow when the program is decomposed into functions and procedures. As the result one can now construct and manipulate ...
متن کاملStochastic Bandits with Pathwise Constraints
We consider the problem of stochastic bandits, with the goal of maximizing a reward while satisfying pathwise constraints. The motivation for this problem comes from cognitive radio networks, in which agents need to choose between different transmission profiles to maximize throughput under certain operational constraints such as limited average power. Stochastic bandits serve as a natural mode...
متن کاملMarkov control processes with pathwise constraints
This paper deals with discrete-time Markov control processes in Borel spaces, with unbounded rewards. The criterion to be optimized is a long-run samplepath (or pathwise) average reward subject to constraints on a long-run pathwise average cost. To study this pathwise problem, we give conditions for the existence of optimal policies for the problem with “expected” constraints. Moreover, we show...
متن کاملlexical decomposition awareness and its effect on delayed receptive and productive recognition and recall of vocabulary knowledge of morphologically complex english words: an iranian efl context
abstract lexical knowledge of complex english words is an important part of language skills and crucial for fluent language use (nation, 2001). the present study, thus, was an attempt to assess the role of morphological decomposition awareness as a vocabulary learning strategy on learners’ productive and receptive recall and recognition of complex english words. so 90 sophomores (female and ma...
15 صفحه اولDecomposition of verification of machine programs based on control-state Abstract State Machines
We are presenting a method verifying programs based on extended control-state Abstract State Machines (ASM). Programs are special initial states in ASM’s. The aim is to prove that every run holds an algebraic specification of functions. The proof of different functions could be made by independent steps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 1990
ISSN: 0098-5589
DOI: 10.1109/32.57625